Q-Learning Algorithms: A Comprehensive Classification and Applications
نویسندگان
چکیده
منابع مشابه
Trust Classification in Social Networks Using Combined Machine Learning Algorithms and Fuzzy Logic
Social networks have become the main infrastructure of today’s daily activities of people during the last decade. In these networks, users interact with each other, share their interests on resources and present their opinions about these resources or spread their information. Since each user has a limited knowledge of other users and most of them are anonymous, the trust factor plays an import...
متن کاملHexagon-Based Q-Learning Algorithm and Applications
This paper presents a hexagon-based Q-leaning algorithm to find a hidden target object with multiple robots. An experimental environment was designed with five small mobile robots, obstacles, and a target object. Robots went in search of a target object while navigating in a hallway where obstacles were strategically placed. This experiment employed two control algorithms: an area-based action ...
متن کاملLearning Algorithms with Applications
We consider three problems in machine learning: * concept learning in the PAC model * mobile robot environment learning * learning-based approaches to protein folding prediction In the PAC framework, we give an efficient algorithm for learning any function on k terms by general DNF. On the other hand, we show that in a well-studied restriction of the PAC model where the learner is not allowed t...
متن کاملEvaluating Learning Algorithms: A Classification Perspective
AAAI thanks you for your ongoing support of AAAI programs through the continuation of your AAAI membership. We count on you to help us deliver the latest information about artificial intelligence to the scientific community, and to nurture new research and innovation through our many conferences, workshops, and symposia. To enable us to continue these efforts, we invite you to consider an addit...
متن کاملNew algorithms of the Q-learning type
We propose two algorithms for Q-learning that use the two timescale stochastic approximation methodology. The first of these updates Q-values of all feasible state-action pairs at each instant while the second updates Q-values of states with actions chosen according to the ‘current’ randomized policy updates. A proof of convergence of the algorithms is shown. Finally, numerical experiments usin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2941229